Complementary partial resolution squares for Steiner triple systems

نویسندگان

  • Jeffrey H. Dinitz
  • Esther R. Lamken
  • Alan C. H. Ling
چکیده

In this paper, we introduce a generalization of frames called partial resolution squares. We are interested in constructing sets of complementary partial resolution squares for Steiner triple systems. Our main result is the existence of six complementary partial resolution squares for Steiner triple systems of order v which can be superimposed in a v × v array so that the resulting array is also the array formed by the superposition of three mutually orthogonal Latin squares of order v where v ≡ 1 (mod 6), v ≥ 7, and v / ∈ {55, 115, 145, 205, 235, 265, 319, 355, 415, 493, 649, 697}.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Almost all Steiner triple systems have perfect matchings

We show that for any n divisible by 3, almost all order-n Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a Steiner triple system and show that almost all Steiner triple systems essentially attain this maximum. We accomplish this via a general theorem comparing a un...

متن کامل

A second infinite family of Steiner triple systems without almost parallel classes

For each positive integer n, we construct a Steiner triple system of order v = 2(3n) + 1 with no almost parallel class; that is, with no set of v−1 3 disjoint triples. In fact, we construct families of (v, k, λ)-designs with an analogous property. The only previously known examples of Steiner triple systems of order congruent to 1 (mod 6) without almost parallel classes were the projective trip...

متن کامل

Steiner Trades That Give Rise to Completely Decomposable Latin Interchanges

In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decomposed into six disjoint latin interchanges. 1 Background information In any combinatorial configuration it is possible to identify a subset which uniquely determines the structure of the configuration and in some cases i...

متن کامل

Embedding Partial Steiner Triple Systems

We prove that a partial Steiner triple system 8 of order n can be embedded in a Steiner triple system T of any given admissible order greater than 4w. Furthermore, if G(S), the missing-edge graph of S, has the property that A(G)<ri(n + l)l and \E(G)\ then # can be embedded in a Steiner triple system of order 2n +1, provided that 2w +1 is admissible. We also prove that if there is a partial Stei...

متن کامل

Perfect countably infinite Steiner triple systems

We use a free construction to prove the existence of perfect Steiner triple systems on a countably infinite point set. We use a specific countably infinite family of partial Steiner triple systems to start the construction, thus yielding 2א0 non-isomorphic perfect systems.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics

دوره 261  شماره 

صفحات  -

تاریخ انتشار 2003